Cubic inflation, mirror graphs, regular maps, and partial cubes
نویسندگان
چکیده
منابع مشابه
Classification of vertex-transitive cubic partial cubes
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: K2C2n, for some n ≥ 2, generalized Petersen graph G(10, 3), permutahedron, truncated cuboctahedron, or truncated icosidodecahedron. This complete classification of cubic, vertex-transitive partial cubes, a f...
متن کاملTribes of Cubic Partial Cubes
Partial cubes are graphs isometrically embeddable into hypercubes. Three infinite families and a few sporadic examples of cubic partial cubes are known. The concept of a tribe is introduced as means to systematize the known examples and establish relations among them. Efficient methods of computation of tribes are developed and several concrete tribes, that include known, as well as new cubic p...
متن کاملOn cubic and edge-critical isometric subgraphs of hypercubes
All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs were confirmed by computer search to be complete. Non-trivial cubic partial cubes on 36, 42, and 48 vertices are also constructed.
متن کاملPartial cubes as subdivision graphs and as generalized Petersen graphs
Isometric subgraphs of hypercubes are known as partial cubes. The subdivision graph of a graph G is obtained from G by subdividing every edge of G. It is proved that for a connected graph G its subdivision graph is a partial cube if and only if every block of G is either a cycle or a complete graph. Regular partial cubes are also considered. In particular it is shown that among the generalized ...
متن کاملSymmetric Cubic Graphs of Girth at Most 7
By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 25 شماره
صفحات -
تاریخ انتشار 2004